منابع مشابه
Variations on Noetherianness
In constructive mathematics, several nonequivalent notions of finiteness exist. In this paper, we continue the study of Noetherian sets in the dependently typed setting of the Agda programming language. We want to say that a set is Noetherian, if, when we are shown elements from it one after another, we will sooner or later have seen some element twice. This idea can be made precise in a number...
متن کاملVariations on a theme.
A ring satisfying x = x is necessarily commutative. We consider a variety of weaker forms of this condition and show that many but not all of them imply commutativity. We also present a variety of elementary proofs of the fact that x = x implies commutativity.
متن کاملVariations on Mobile Processes
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. Two bisimilarities, local bisimilarity and barbed bisimilarity, on chi processes are studied and are shown to be congruence relations. The former equivalence turns out to be strictly stronger than the latter. It is shown that chi calculus is capable of mod...
متن کاملVariations on stability
We explore the effects of non-abelian dynamics of D-branes on their stability and introduce Hitchin-like modifications to previously-known stability conditions. The relation to brane-antibrane systems is used in order to rewrite the equations in terms of superconnections and arrive at deformed vortex equations.
متن کاملVariations on Ω - Boundedness
Let P be a property (or, equivalently, a class) of topological spaces. A space X is called P-bounded if every subspace of X with (or in) P has compact closure. Thus, countable-bounded has been known as ω-bounded and (σ-compact)-bounded as strongly ω-bounded. In this paper we present a systematic study of the interrelations of these two known “boundedness” concepts with P-boundedness where P is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.207.4